Arc | a Veriication Tool for Concurrent Systems

نویسندگان

  • Atanas N. Parashkevov
  • Jay Yantchev
چکیده

This paper presents the ARC tool | a formal veri-cation tool for CSP currently under development. The internal workings of the tool are described using a practically oriented approach. The semantics of a CSP process are translated into a corresponding LTS represented by OBDDs, and the latter is then checked by exhaustive state-space search. This approach and some other implementation enhancements allow checking of processes with up to 10 40 states. We also present a number of examples and compare the performance of ARC with that of other veriication tools.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Arc | a Tool for Eecient Reenement and Equivalence Checking for Csp

| This paper presents the design and implementation of ARC | a tool for automated veriication of concurrent systems. The tool is based on the untimed CSP language, its semantic models and theory of reenement. We alleviate the combinatorial explosion problem using Ordered Binary Decision Diagrams (OBDDs) for the internal representation of complex data structures | sets and labeled transition sys...

متن کامل

The Concurrency Workbench: a Semantics Based Tool for the Veriication of Concurrent Systems

The Concurrency Workbench is an automated tool for analyzing networks of nite-state processes expressed in Milner's Calculus of Communicating Systems. Its key feature is its breadth: a variety of diierent veriication methods, including equivalence checking, preorder checking, and model checking, are supported for several diierent process semantics. One experience from our work is that a large n...

متن کامل

Generic tools for verifying concurrent systems

Despite the enormous strides made in automatic veriication technology over the past decade and a half, tools such as model checkers remain relatively underused in the development of software. One reason for this is that the bewildering array of speciica-tion and veriication formalisms complicates the development and adoption by users of relevant tool support. This paper proposes a remedy to thi...

متن کامل

Will Concurrency Theory Help Verifying Multi-agent Systems? { a Case Study {

The veriication of multi agent systems is an important and diicult task. Though much work is spent on veriication in concurrency theory only few results and tools are used in multi-agent systems. In this paper, we investigate how CCS, the calculus for concurrent systems, may contribute to the veriication of multi-agent systems. We review an architecture for a diagnosis agent and show how the to...

متن کامل

Strategies Planner Knowledge

The veriication of multi agent systems is an important and diicult task. Though much work is spent on veriication in concurrency theory only few results and tools are used in multi-agent systems. In this paper, we investigate how CCS, the calculus for concurrent systems, may contribute to the veriication of multi-agent systems. We review an architecture for a diagnosis agent and show how the to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996